Simplification of Arbitrary Polyhedral Meshes
نویسندگان
چکیده
Surface models containing billions of polygons are becoming more frequent in computer graphics. Mesh simplification is necessary for displaying such surfaces at interactive rates. We describe a novel method for simplifying polyhedral meshes while producing multiple levels of detail for progressive transmission and interactive exploration. Unlike previous work on mesh simplification, our method is not restricted to triangle meshes. We propose a highly efficient edge-collapsing algorithm for meshes composed of non-planar multi-sided polygons based on a simple edge-selection strategy.
منابع مشابه
A freeform shape optimization of complex structures represented by arbitrary polygonal or polyhedral meshes
In this paper we propose a new scheme for freeform shape optimization on arbitrary polygonal or polyhedral meshes. The approach consists of three main steps: (1) surface partitioning of polygonal meshes into different patches; (2) a new freeform perturbation scheme of using the Cox–de Boor basis function over arbitrary polygonal meshes, which supports multi-resolution shape optimization and doe...
متن کاملA mimetic tensor artificial viscosity method for arbitrary polyhedral meshes
We construct a new mimetic tensor artificial viscosity on general polyhedral meshes. The tensor viscosity is designed as a discretization of the differential operator div (μ∇u) with the full fourth-order tensor μ. We demonstrate performance of the new artificial viscosity on a set of test problems.
متن کاملFast and Accurate Hausdorff Distance Calculation between Meshes
Complex models generated e.g. with a laser range scanner often consist of several thousand or million triangles. For efficient rendering this high number of primitives has to be reduced. An important property of mesh reduction – or simplification – algorithms used for rendering is the control over the introduced geometric error. In general, the better this control is, the slower the simplificat...
متن کاملBoolean operations on arbitrary polyhedral meshes
A floating-point arithmetic algorithm designed for solving usual boolean operations (intersection, union, and difference) on arbitrary polyhedral meshes is described in this paper. It can be used in many preand post-processing applications in computational physics (e.g. cut-cell volume mesh generation or high order conservative remapping). The method provides conformal polyhedral meshes upon ex...
متن کاملControl of Polygonal Mesh Resolution for 3-D Computer Vision
A common representation in 3-D computer vision is the polygonal surface mesh because meshes can model objects of arbitrary shape and are easily constructed from sensed 3-D data. The resolution of a surface mesh is the overall spacing between vertices that comprise the mesh. Because sensed 3-D points are often unevenly distributed, the resolution of a surface mesh is often poorly defined. We pre...
متن کامل